Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
نویسندگان
چکیده
منابع مشابه
Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
Parameterized complexity theory has enabled a refined classification of the difficulty of NPhard optimization problems on graphs with respect to key structural properties, and so to a better understanding of their true difficulties. More recently, hardness results for problems in P were achieved using reasonable complexity theoretic assumptions such as: Strong Exponential Time Hypothesis (SETH)...
متن کاملComputing the Tutte Polynomial on Graphs of Bounded Clique-Width
The Tutte polynomial is a notoriously hard graph invariant, and efficient algorithms for it are known only for a few special graph classes, like for those of bounded tree-width. The notion of clique-width extends the definition of cograhs (graphs without induced P4), and it is a more general notion than that of tree-width. We show a subexponential algorithm (running in time exp O(n) ) for compu...
متن کاملDeciding Clique-Width for Graphs of Bounded Tree-Width
We show that there exists a linear time algorithm for deciding whether a graph of bounded tree-width has clique-width k for some fixed integer k. Communicated by Giuseppe Liotta and Ioannis G. Tollis: submitted October 2001; revised July 2002 and February 2003. The work of the second author was supported by the German Research Association (DFG) grant WA 674/9-2. W. Espelage et al., Deciding Cli...
متن کاملLine graphs of bounded clique-width
We show that a set of graphs has bounded tree-width or bounded path-width if and only if the corresponding set of line graphs has bounded clique-width or bounded linear clique-width, respectively. This relationship implies some interesting algorithmic properties and re-proves already known results in a very simpleway. It also shows that theminimization problem forNLC-width isNP-complete. © 2007...
متن کاملGraphs of small bounded linear clique-width
In this paper we give the first characterisation of graphs with linear clique-width at most 3, and we give a polynomial-time recognition algorithm for such graphs. In addition, we give a new characterisation of graphs with linear clique-width at most 2 and a new layout characterisation of linear clique-width in general. Among our results is also a decomposition scheme that preserves the linear ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Algorithms
سال: 2019
ISSN: 1549-6325,1549-6333
DOI: 10.1145/3310228